Triangular Bézier Clipping
نویسندگان
چکیده
This short paper introduces a new approach to finding ray– patch intersections with triangular Bernstein–Bézier patches of arbitrary degree. Unlike a previous approach based on a combination of hierarchical subdivision and a Newton–like iteration scheme [7], this work extends the concept of Bézier clipping to the triangular domain. The problem of reporting wrong intersections, inherent to the original Bézier clipping algorithm [5], is investigated and opposed to the triangular case. It turns out that reporting wrong hits is very improbable, even close to impossible, in the triangular set-up.
منابع مشابه
Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces
An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is con...
متن کاملApproximate Continuity for Functional, Triangular Bézier Patches
In this paper, we investigate a relaxation of the C continuity conditions between functional, triangular Bézier patches, allowing for patches to meet approximately C. We analyze the cross boundary continuity of functional triangular Bézier patches, and derive a bound for the discontinuity in the normals between two patches based on their control points. We test our discontinuity bound on a simp...
متن کاملDegree Reduction of Triangular Bézier Surfaces with C-Vertices
The issue of Cα-degree reduction of triangular Bézier surfaces is exposed. It is anticipated that both triangular Bézier surfaces are Cα-continuous at the vertices. The Euclidean norm as well as the L2−norm is used. The final solutions are given in terms of the matrix of degree raising, the Gram matrix, and the Bézier points. Moreover, it is shown that the solutions using both norms are equival...
متن کاملRaytracing Triangular Bézier Patches
We present a new approach to finding ray–patch intersections with triangular Bernstein–Bézier patches of arbitrary degree. This paper extends and complements on the short presentation 17. Unlike a previous approach which was based on a combination of hierarchical subdivision and a Newton–like iteration scheme 21, this work adapts the concept of Bézier clipping to the triangular domain. The prob...
متن کاملSubdivision Algorithms and Convexity Analysis for Rational Bézier Triangular Patches
Triangular surfaces are important because in areas where the geometry is not similar to rectangular domain, the rectangular surface patch will collapse into a triangular patch. In such a case, one boundary edge may collapse into a boundary vertex of the patch, giving rise to geometric dissimilarities (e.g. shape parameters, Gaussian curvature distribution, cross boundary continuities etc.) and ...
متن کامل